VisBDD - A Webbased Visualization Framework for OBDD Algorithms
نویسندگان
چکیده
منابع مشابه
Proceedings Template - WORD
CT presents a web-based visualization framework nded for learning and understanding basic algorithms rdered Binary Decision Diagrams (OBDDs). With key algorithm for OBDD-synthesis, the ITEn be explored in depth and step-by-step by the user, lved data structures can be made visible at different traction. The framework is intended as well as for lso for professionals, who want to gain more insigh...
متن کاملJINC: a multi-threaded library for higher-order weighted decision diagram manipulation
Ordered Binary Decision Diagrams (OBDDs) have been proven to be an efficient data structure for symbolic algorithms. The efficiency of the symbolic methods depends on the underlying OBDD library. Available OBDD libraries are based on the standard concepts and so far only differ in implementation details. This thesis introduces new techniques to increase run-time and space-efficiency of an OBDD ...
متن کاملOn OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables
In 2004 Atserias, Kolaitis and Vardi proposed OBDD-based propositional proof systems that prove unsatisfiability of a CNF formula by deduction of identically false OBDD from OBDDs representing clauses of the initial formula. All OBDDs in such proofs have the same order of variables. We initiate the study of OBDD based proof systems that additionally contain a rule that allows to change the orde...
متن کاملObdd-based Deterministic Planning Using the Umop Planning Framework
Model checking representation and search techniques were recently shown to be eeciently applicable to planning. Ordered Binary Decision Diagrams (obdds) encode a planning domain as a nite transition system and fast algorithms from model checking search for a solution plan. With proper encodings, obdds can effectively scale and can provide plans for complex planning domains. In this paper, we pr...
متن کاملOBDDs and (Almost) $k$-wise Independent Random Variables
OBDD-based graph algorithms deal with the characteristic function of the edge set E of a graph G = (V,E) which is represented by an OBDD and solve optimization problems by mainly using functional operations. We present an OBDD-based algorithm which uses randomization for the first time. In particular, we give a maximal matching algorithm with O(log |V |) functional operations in expectation. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Universität Trier, Mathematik/Informatik, Forschungsbericht
دوره 01-21 شماره
صفحات -
تاریخ انتشار 2001